Quantum Game—Research on “PQ” Problem

نویسندگان

چکیده

This paper reviews the coin flipping problem of PQ in a classical two-player game, and shows that when one player adopts quantum strategy, he can beat his opponent gain higher returns. By means quantitative means, whole is put more general fair condition, it generalized studied again from many aspects angles. Finally, we get some essential important conclusions, through examples to explain conclusions its practical significances. At same time, this gives definitions imperfect games perfect games, revises game make fair, studies multi-round version flipping. Some basic are obtained, meaning perfectly explained practice.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POLYNOMIAL CLONES ON GROUPS OF ORDER pq

For two distinct primes p, q, we describe those clones on a set of size pq that contain a given group operation and all constants operations. We show that each such clone is determined by congruences and commutator relations. Thus we obtain that there is only a finite number of such clones on a fixed set.

متن کامل

Detection of PerturbedQuantization (PQ) SteganographyBased on EmpiricalMatrix

A B S T R A C T Perturbed Quantization (PQ) steganography scheme is almost undetectable with the current steganalysis methods. We present a new steganalysis method for detection of this data hiding algorithm. We show that the PQ method distorts the dependencies of DCT coefficient values; especially changes much lower than significant bitplanes. For steganalysis of PQ, we propose features extrac...

متن کامل

On a problem in quantum summation

We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a p-summability condition for 1 ≤ p < 2. This settles a problem left open in Heinrich (2001).

متن کامل

On the quantum inverse scattering problem

A general method for solving the so-called quantum inverse scattering problem (namely the reconstruction of local quantum (field) operators in term of the quantum monodromy matrix satisfying a Yang-Baxter quadratic algebra governed by an R-matrix) for a large class of lattice quantum integrable models is given. The principal requirement being the initial condition (R(0) = P , the permutation op...

متن کامل

Factoring N = pq

We discuss the problem of factoring N = pq and survey some approaches. We then present a specialized factoring algorithm that runs in time Õ(q0.31), which is comparable to the runtime Õ(p) of the factoring algorithm for integers of the form N = pq presented in [1]. We then survey the factoring algorithm of [1] and discuss the number of advice bits needed for it to run in polynomial time. Furthe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Physics

سال: 2023

ISSN: ['1000-3290']

DOI: https://doi.org/10.7498/aps.72.20230592